The Gap between Complex Structured Singular Value Μ and Its Upper Bound Is Infinite

نویسنده

  • S. TREIL
چکیده

Here and below, ‖A‖ always denotes the induced (by the Euclidean norm in Cn) operator norm of A, i. e. its maximal singular value. Entries of the matrices A and ∆ are complex, so we deal with complex structured singular value. The first equality above is the definition of μ, the second is a simple exercise in linear algebra. Note, that if in the definition of μ we take infimum over all matrices, not only diagonal, we get exactly the norm ‖A‖. On the other hand, if we take infimum over a smaller set of scalar matrices λI, λ ∈ C, we get exactly the spectral radius r(A) of the matrix A. So μ(A) can be estimated as r(A) μ(A) ‖A‖. The structured singular value μ was introduced in connection with robust control with structured uncertainties, see [1, 2] (we should also mention papers by M. Safonov [9, 10] where the multivariable stability margin Km(G), which is essentially the reciprocal of μ, was introduced). Without going into a lot of details (a reader interested in a detailed introduction into the subject, with all references and complete history, should look somewhere else, [13] will be a good reference), let us just remind the reader main ideas. Consider the system on Fig. 1 with uncertainty ∆ in the feedback loop. Here G is causal stable LTI (Linear Time Invariant) plant. An important notion in robust stability is the so called stability margin. Suppose, that our uncertainty ∆ belongs to some class U of stable causal

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Gap Between the Complex Structured Singular Value and Its Convex Upper Bound

The gap between the complex structured singular value of a complex matrix M and its convex upper bound is considered. New necessary and sufficient conditions for the existence of the gap are derived. It is shown that determining whether there exists such a gap is as difficult as evaluating a structured singular value of a reduced rank matrix (whose rank is equal to the multiplicity of the large...

متن کامل

On Μ-analysis and Synthesis for Systems Subject to Real Uncertainty

The paper introduces a new approach for the computation of a lower bound on the structured singular value (SSV), μ in the presence of purely real and mixed/complex uncertainties. The approach utilises a frequency sweeping technique based on a linear fractional transformation representation of structured uncertainty. The technique is applied to a well-known civil transport aircraft example. A fi...

متن کامل

M ay 2 00 8 Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value ∗

In this paper, we have developed a parallel branch and bound algorithm which computes the maximal structured singular value μ without tightly bounding μ for each frequency and thus significantly reduce the computational complexity.

متن کامل

Extended Matrix Cube Theorems with Applications to µ-Theory in Control

In this paper, we study semi-infinite systems of Linear Matrix Inequalities which are generically NP-hard. For these systems, we introduce computationally tractable approximations and derive quantitative guarantees of their quality. As applications, we discuss the problem of maximizing a Hermitian quadratic form over the complex unit cube and the problem of bounding the complex structured singu...

متن کامل

The complex structured singular value

A tutorial introduction to the complex structured singular value (μ) is presented, with an emphasis on the mathematical aspects of μ. The μ-based methods discussed here have been useful for analyzing the performance and robustness properties of linear feedback systems. Several tests for robust stability and performance with computable bounds for transfer functions and their state-space realizat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000